Channel coding strategies for cellular radio
نویسندگان
چکیده
منابع مشابه
Channel Assignment in Cellular Radio
Kumar N . Sivarajan and Robert J . McEliece, California Institute of Technology,’ and John W. Ketchum, GTE Laboratories Incorporated. In this paper, we describe some heuristic channel assignment algorithms for cellular systems, that we have recently developed. These algorithms have yielded optimal, or near-optimal assignments, in many cases. The channel assignment problem can be viewed as a gen...
متن کاملSource-Channel Coding Strategies: Tandem Coding vs. Channel-Optimized Quantization
Two common source-channel coding strategies, tandem coding and channel-optimized quantization, are compared on the basis of distortion vs. complexity by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. Transform coding is used in each strategy, and Reed-Solomon codes are added to form the tandem code. For each strategy, formulas...
متن کاملStrategies for Delay-Limited Source-Channel Coding
In point-to-point source-channel communication with a fidelity criterion and a transmission cost constraint, the region of achievable cost and fidelity pairs is completely characterized by Shannon’s separation theorem. However, this is in general only true if coding of arbitrary complexity and delay is admitted. If the delay is constrained, the separation theorem only provides an outer bound to...
متن کاملChannel Assignment Strategies for Cellular Phone Systems
Nowadays people benefit a lot from mobile communication systems. One of recent major breakthroughs in solving the problem of spectral congestion is the cellular concept, which means replacing a large transmitter with many little transmitters, each providing coverage to a small piece of the service area. Neighboring transmitters are assigned different groups of channels so that the interference ...
متن کاملChannel allocation in cellular radio networks
-In this article, two efficient heuristic algorithms are suggested for the channel allocation problem which minimizes the average blocking probability of the whole network subject to the co-ebannel, adjacent-site and co-site interference constraints, given the number of available channels. We convert this problem into a convenient form using the piecewise linearization technique and the concept...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 1995
ISSN: 0018-9545
DOI: 10.1109/25.467960